Universit a Di Pisa a Logic-based Calculus of Fluents a Logic-based Calculus of Fluents Universit a Degli Studi Di Pisa Dipartimento Di Informatica a Logic-based Calculus of Fluents

This report formally deenes the class of all problems on Reasoning about Actions and Change, where accurate and complete information about actions, together with strict inertia in continuous time, continuous change and alternative results of possibly concurrent and independent actions are the assumed properties. The intended model set for each member in the class is deened in terms of a model-theoretic trajectory semantics. The case is designated , in the Features and Fluents framework, with the K-RACi family of reasoning problems. A x-point characterization of the subclass Ksp-RAdCi is then given in terms of a simulative algebraic semantics, and show which are the diiculties when approaching the full class with that method. A non-simulative algebraic semantics is then presented as an alternative algebraic characterization of the model-theoretic trajectory semantics. Still the characterization is made in terms of complete lattices and continuous operators on those complete lattices. The non-simulative algebraic semantics is shown to be correct and complete with respect to the trajectory-semantics, when applied to reasoning problems in K-RACi. Finally, adopting the non-simulative algebraic semantics as proof procedure, a logic-based Calculus of Fluents is deened, via a meta-theoretic extension of the Horn Clause Logic using the non-ground representation of object level variables. The meta-interpreter consists in the Horn clause representation of the proof procedure. The calculus is shown to be decidable, domain independent and class dependent; its semantics consists in the non-simulative algebraic semantics, and is executable as a logic program by the SLD-resolution rule.